./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32adbfac5f3e3ea232180afd045da0027ca6d993 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32adbfac5f3e3ea232180afd045da0027ca6d993 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:01:18,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:01:18,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:01:18,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:01:18,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:01:18,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:01:18,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:01:18,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:01:18,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:01:18,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:01:18,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:01:18,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:01:18,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:01:18,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:01:18,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:01:18,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:01:18,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:01:18,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:01:18,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:01:18,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:01:18,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:01:18,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:01:18,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:01:18,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:01:18,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:01:18,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:01:18,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:01:18,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:01:18,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:01:18,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:01:18,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:01:18,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:01:18,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:01:18,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:01:18,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:01:18,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:01:18,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:01:18,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:01:18,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:01:18,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:01:18,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:01:18,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:01:18,566 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:01:18,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:01:18,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:01:18,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:01:18,569 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:01:18,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:01:18,570 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:01:18,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:01:18,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:01:18,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:01:18,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:01:18,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:01:18,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:01:18,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:01:18,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:01:18,572 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:01:18,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:01:18,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:01:18,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:01:18,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:01:18,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:01:18,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:18,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:01:18,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:01:18,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:01:18,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:01:18,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:01:18,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:01:18,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:01:18,576 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-10-25 22:01:18,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:01:18,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:01:18,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:01:18,993 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:01:18,994 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:01:18,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-25 22:01:19,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b7cf163/84c6ca3111a54aaca48cb38ea3882b60/FLAGe021f7875 [2020-10-25 22:01:19,615 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:01:19,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-25 22:01:19,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b7cf163/84c6ca3111a54aaca48cb38ea3882b60/FLAGe021f7875 [2020-10-25 22:01:20,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b7cf163/84c6ca3111a54aaca48cb38ea3882b60 [2020-10-25 22:01:20,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:01:20,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:01:20,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:20,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:01:20,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:01:20,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6473412d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20, skipping insertion in model container [2020-10-25 22:01:20,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:01:20,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:01:20,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:20,286 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:01:20,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:20,335 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:01:20,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20 WrapperNode [2020-10-25 22:01:20,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:20,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:20,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:01:20,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:01:20,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:20,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:01:20,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:01:20,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:01:20,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... [2020-10-25 22:01:20,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:01:20,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:01:20,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:01:20,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:01:20,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:01:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:01:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-25 22:01:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:01:20,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:01:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 22:01:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:01:21,231 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:01:21,231 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-25 22:01:21,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:21 BoogieIcfgContainer [2020-10-25 22:01:21,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:01:21,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:01:21,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:01:21,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:01:21,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:01:20" (1/3) ... [2020-10-25 22:01:21,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72077a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:21, skipping insertion in model container [2020-10-25 22:01:21,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:20" (2/3) ... [2020-10-25 22:01:21,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72077a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:21, skipping insertion in model container [2020-10-25 22:01:21,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:21" (3/3) ... [2020-10-25 22:01:21,242 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-10-25 22:01:21,252 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:01:21,258 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 22:01:21,273 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 22:01:21,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:01:21,302 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:01:21,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:01:21,303 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:01:21,303 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:01:21,303 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:01:21,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:01:21,303 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:01:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-25 22:01:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:01:21,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:21,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:21,329 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-25 22:01:21,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:21,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451091791] [2020-10-25 22:01:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:21,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451091791] [2020-10-25 22:01:21,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:21,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:21,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291876469] [2020-10-25 22:01:21,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:21,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:21,579 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-10-25 22:01:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:21,654 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2020-10-25 22:01:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:01:21,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-25 22:01:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:21,667 INFO L225 Difference]: With dead ends: 92 [2020-10-25 22:01:21,667 INFO L226 Difference]: Without dead ends: 50 [2020-10-25 22:01:21,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-25 22:01:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-25 22:01:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:01:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-25 22:01:21,712 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-10-25 22:01:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:21,713 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-25 22:01:21,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-25 22:01:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:01:21,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:21,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:21,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:01:21,716 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-25 22:01:21,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:21,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356148285] [2020-10-25 22:01:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:21,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356148285] [2020-10-25 22:01:21,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:21,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:21,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726262030] [2020-10-25 22:01:21,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:21,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:21,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:21,814 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-10-25 22:01:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:21,886 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-10-25 22:01:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:21,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-25 22:01:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:21,889 INFO L225 Difference]: With dead ends: 77 [2020-10-25 22:01:21,889 INFO L226 Difference]: Without dead ends: 64 [2020-10-25 22:01:21,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-25 22:01:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-10-25 22:01:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:21,899 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-25 22:01:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:21,900 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:21,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:01:21,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:21,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:21,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:01:21,902 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-10-25 22:01:21,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:21,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396127593] [2020-10-25 22:01:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:21,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396127593] [2020-10-25 22:01:21,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:21,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:21,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892387497] [2020-10-25 22:01:21,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:21,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:21,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:21,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:21,976 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-25 22:01:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:22,032 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-10-25 22:01:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:22,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-25 22:01:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:22,034 INFO L225 Difference]: With dead ends: 79 [2020-10-25 22:01:22,034 INFO L226 Difference]: Without dead ends: 66 [2020-10-25 22:01:22,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:22,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-25 22:01:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-10-25 22:01:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:22,047 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-10-25 22:01:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:22,048 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:22,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 22:01:22,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:22,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:22,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:01:22,052 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:22,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-10-25 22:01:22,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:22,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719235201] [2020-10-25 22:01:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:22,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719235201] [2020-10-25 22:01:22,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:22,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:01:22,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867167014] [2020-10-25 22:01:22,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:22,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:22,192 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-25 22:01:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:22,284 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-10-25 22:01:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:22,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-25 22:01:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:22,287 INFO L225 Difference]: With dead ends: 81 [2020-10-25 22:01:22,291 INFO L226 Difference]: Without dead ends: 68 [2020-10-25 22:01:22,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-25 22:01:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-10-25 22:01:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:22,309 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-10-25 22:01:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:22,309 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:22,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 22:01:22,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:22,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:22,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:01:22,314 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-25 22:01:22,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:22,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716719571] [2020-10-25 22:01:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:22,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716719571] [2020-10-25 22:01:22,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:22,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:01:22,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358252597] [2020-10-25 22:01:22,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:01:22,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:01:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:01:22,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:01:22,408 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-25 22:01:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:22,422 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-25 22:01:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:01:22,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 22:01:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:22,423 INFO L225 Difference]: With dead ends: 50 [2020-10-25 22:01:22,424 INFO L226 Difference]: Without dead ends: 48 [2020-10-25 22:01:22,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:01:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-25 22:01:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-25 22:01:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-25 22:01:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-25 22:01:22,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-25 22:01:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:22,431 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-25 22:01:22,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:01:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-25 22:01:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 22:01:22,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:22,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:22,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:01:22,432 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-25 22:01:22,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:01:22,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240782505] [2020-10-25 22:01:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:01:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:01:22,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:01:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:01:22,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:01:22,541 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 22:01:22,542 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 22:01:22,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:01:22,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:01:22 BoogieIcfgContainer [2020-10-25 22:01:22,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:01:22,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:01:22,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:01:22,589 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:01:22,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:21" (3/4) ... [2020-10-25 22:01:22,593 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 22:01:22,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:01:22,596 INFO L168 Benchmark]: Toolchain (without parser) took 2577.94 ms. Allocated memory was 46.1 MB in the beginning and 73.4 MB in the end (delta: 27.3 MB). Free memory was 23.3 MB in the beginning and 36.3 MB in the end (delta: -13.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,597 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory is still 23.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:22,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.77 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.7 MB in the beginning and 34.2 MB in the end (delta: -11.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.37 ms. Allocated memory is still 58.7 MB. Free memory was 34.0 MB in the beginning and 32.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,602 INFO L168 Benchmark]: Boogie Preprocessor took 38.69 ms. Allocated memory is still 58.7 MB. Free memory was 32.1 MB in the beginning and 30.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,603 INFO L168 Benchmark]: RCFGBuilder took 799.15 ms. Allocated memory is still 58.7 MB. Free memory was 30.5 MB in the beginning and 38.0 MB in the end (delta: -7.5 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,607 INFO L168 Benchmark]: TraceAbstraction took 1353.01 ms. Allocated memory was 58.7 MB in the beginning and 73.4 MB in the end (delta: 14.7 MB). Free memory was 37.8 MB in the beginning and 36.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,608 INFO L168 Benchmark]: Witness Printer took 5.23 ms. Allocated memory is still 73.4 MB. Free memory was 36.8 MB in the beginning and 36.3 MB in the end (delta: 472.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:22,613 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.30 ms. Allocated memory is still 46.1 MB. Free memory is still 23.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 308.77 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.7 MB in the beginning and 34.2 MB in the end (delta: -11.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.37 ms. Allocated memory is still 58.7 MB. Free memory was 34.0 MB in the beginning and 32.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.69 ms. Allocated memory is still 58.7 MB. Free memory was 32.1 MB in the beginning and 30.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 799.15 ms. Allocated memory is still 58.7 MB. Free memory was 30.5 MB in the beginning and 38.0 MB in the end (delta: -7.5 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1353.01 ms. Allocated memory was 58.7 MB in the beginning and 73.4 MB in the end (delta: 14.7 MB). Free memory was 37.8 MB in the beginning and 36.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.23 ms. Allocated memory is still 73.4 MB. Free memory was 36.8 MB in the beginning and 36.3 MB in the end (delta: 472.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L23] __uint32_t w; [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; [L72] float res = fmax_float(x, y); [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L3] __assert_fail("0", "float_req_bl_1251.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, 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, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-5485861 [2020-10-25 22:01:25,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:01:25,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:01:25,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:01:25,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:01:25,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:01:25,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:01:25,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:01:25,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:01:25,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:01:25,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:01:25,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:01:25,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:01:25,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:01:25,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:01:25,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:01:25,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:01:25,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:01:25,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:01:25,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:01:25,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:01:25,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:01:25,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:01:25,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:01:25,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:01:25,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:01:25,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:01:25,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:01:25,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:01:25,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:01:25,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:01:25,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:01:25,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:01:25,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:01:25,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:01:25,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:01:25,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:01:25,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:01:25,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:01:25,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:01:25,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:01:25,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 22:01:25,419 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:01:25,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:01:25,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:01:25,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:01:25,424 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:01:25,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:01:25,424 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:01:25,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:01:25,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:01:25,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:01:25,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:01:25,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:01:25,427 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 22:01:25,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 22:01:25,428 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:01:25,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:01:25,428 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:01:25,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:01:25,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:01:25,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:01:25,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:01:25,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:01:25,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:25,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:01:25,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:01:25,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:01:25,431 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 22:01:25,431 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 22:01:25,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:01:25,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:01:25,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 22:01:25,432 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-10-25 22:01:25,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:01:25,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:01:25,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:01:25,970 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:01:25,971 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:01:25,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-25 22:01:26,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82da60f34/044ca18c3cdc484cbc93005dafcf238b/FLAG11be251cf [2020-10-25 22:01:26,628 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:01:26,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-25 22:01:26,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82da60f34/044ca18c3cdc484cbc93005dafcf238b/FLAG11be251cf [2020-10-25 22:01:26,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82da60f34/044ca18c3cdc484cbc93005dafcf238b [2020-10-25 22:01:26,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:01:26,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:01:26,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:26,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:01:26,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:01:26,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:26" (1/1) ... [2020-10-25 22:01:26,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360c379e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:26, skipping insertion in model container [2020-10-25 22:01:26,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:01:26" (1/1) ... [2020-10-25 22:01:27,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:01:27,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:01:27,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:27,282 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:01:27,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:01:27,330 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:01:27,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27 WrapperNode [2020-10-25 22:01:27,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:01:27,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:27,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:01:27,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:01:27,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:01:27,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:01:27,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:01:27,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:01:27,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... [2020-10-25 22:01:27,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:01:27,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:01:27,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:01:27,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:01:27,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:01:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 22:01:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:01:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-25 22:01:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:01:27,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:01:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-25 22:01:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:01:28,080 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:01:28,081 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-25 22:01:28,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:28 BoogieIcfgContainer [2020-10-25 22:01:28,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:01:28,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:01:28,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:01:28,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:01:28,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:01:26" (1/3) ... [2020-10-25 22:01:28,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cf47f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:28, skipping insertion in model container [2020-10-25 22:01:28,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:01:27" (2/3) ... [2020-10-25 22:01:28,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cf47f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:01:28, skipping insertion in model container [2020-10-25 22:01:28,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:28" (3/3) ... [2020-10-25 22:01:28,094 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-10-25 22:01:28,109 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:01:28,115 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 22:01:28,136 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 22:01:28,183 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:01:28,184 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:01:28,184 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:01:28,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:01:28,184 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:01:28,184 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:01:28,185 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:01:28,185 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:01:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-25 22:01:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:01:28,217 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:28,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:28,219 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:28,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-25 22:01:28,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:28,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166510680] [2020-10-25 22:01:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:28,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-25 22:01:28,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:28,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:28,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166510680] [2020-10-25 22:01:28,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:28,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-25 22:01:28,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807273122] [2020-10-25 22:01:28,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 22:01:28,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 22:01:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:01:28,518 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2020-10-25 22:01:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:28,550 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2020-10-25 22:01:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 22:01:28,552 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-10-25 22:01:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:28,566 INFO L225 Difference]: With dead ends: 84 [2020-10-25 22:01:28,566 INFO L226 Difference]: Without dead ends: 43 [2020-10-25 22:01:28,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:01:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-25 22:01:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-25 22:01:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-25 22:01:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-25 22:01:28,625 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-25 22:01:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:28,625 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-25 22:01:28,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 22:01:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-25 22:01:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 22:01:28,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:28,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:28,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 22:01:28,848 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-10-25 22:01:28,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:28,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43095189] [2020-10-25 22:01:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:28,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:28,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:28,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:28,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43095189] [2020-10-25 22:01:28,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:28,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-25 22:01:28,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632709944] [2020-10-25 22:01:28,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:28,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:28,998 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-10-25 22:01:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:29,053 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-10-25 22:01:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:01:29,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-25 22:01:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:29,056 INFO L225 Difference]: With dead ends: 82 [2020-10-25 22:01:29,056 INFO L226 Difference]: Without dead ends: 50 [2020-10-25 22:01:29,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-25 22:01:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-25 22:01:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:01:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-25 22:01:29,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-10-25 22:01:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:29,066 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-25 22:01:29,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-25 22:01:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:01:29,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:29,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:29,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 22:01:29,284 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-25 22:01:29,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:29,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679794872] [2020-10-25 22:01:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:29,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:29,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:29,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:29,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679794872] [2020-10-25 22:01:29,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:29,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 22:01:29,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378443220] [2020-10-25 22:01:29,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:01:29,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:29,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:01:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:01:29,457 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-10-25 22:01:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:29,545 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-10-25 22:01:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:01:29,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-25 22:01:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:29,548 INFO L225 Difference]: With dead ends: 96 [2020-10-25 22:01:29,548 INFO L226 Difference]: Without dead ends: 83 [2020-10-25 22:01:29,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:01:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-25 22:01:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-10-25 22:01:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-25 22:01:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-25 22:01:29,558 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-25 22:01:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:29,558 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-25 22:01:29,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:01:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-25 22:01:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 22:01:29,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:29,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:29,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 22:01:29,783 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:29,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-25 22:01:29,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:29,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429574814] [2020-10-25 22:01:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:29,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:29,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:29,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:29,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:29,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:29,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:30,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429574814] [2020-10-25 22:01:30,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:30,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-25 22:01:30,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011612447] [2020-10-25 22:01:30,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:30,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:30,059 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2020-10-25 22:01:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:30,556 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2020-10-25 22:01:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:01:30,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-25 22:01:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:30,559 INFO L225 Difference]: With dead ends: 149 [2020-10-25 22:01:30,559 INFO L226 Difference]: Without dead ends: 140 [2020-10-25 22:01:30,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-25 22:01:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2020-10-25 22:01:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-25 22:01:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2020-10-25 22:01:30,573 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2020-10-25 22:01:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:30,574 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2020-10-25 22:01:30,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2020-10-25 22:01:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 22:01:30,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:30,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:30,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-25 22:01:30,790 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-25 22:01:30,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:30,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066383885] [2020-10-25 22:01:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:30,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:30,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:30,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:30,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:30,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:31,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:31,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066383885] [2020-10-25 22:01:31,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:31,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-10-25 22:01:31,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055403025] [2020-10-25 22:01:31,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:01:31,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:01:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:31,285 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2020-10-25 22:01:33,333 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-25 22:01:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:33,621 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2020-10-25 22:01:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-25 22:01:33,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-25 22:01:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:33,626 INFO L225 Difference]: With dead ends: 180 [2020-10-25 22:01:33,626 INFO L226 Difference]: Without dead ends: 178 [2020-10-25 22:01:33,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-10-25 22:01:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-25 22:01:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2020-10-25 22:01:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-25 22:01:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2020-10-25 22:01:33,644 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2020-10-25 22:01:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:33,645 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2020-10-25 22:01:33,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:01:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-10-25 22:01:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 22:01:33,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:33,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:33,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-25 22:01:33,861 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2020-10-25 22:01:33,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:33,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006374494] [2020-10-25 22:01:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:33,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:33,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:33,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:33,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:34,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:34,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:34,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:34,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:34,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006374494] [2020-10-25 22:01:34,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:34,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-25 22:01:34,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588108517] [2020-10-25 22:01:34,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:01:34,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:01:34,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:01:34,115 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2020-10-25 22:01:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:34,638 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2020-10-25 22:01:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:01:34,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-25 22:01:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:34,641 INFO L225 Difference]: With dead ends: 166 [2020-10-25 22:01:34,641 INFO L226 Difference]: Without dead ends: 131 [2020-10-25 22:01:34,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-25 22:01:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2020-10-25 22:01:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-25 22:01:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2020-10-25 22:01:34,655 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2020-10-25 22:01:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:34,656 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2020-10-25 22:01:34,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:01:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2020-10-25 22:01:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 22:01:34,657 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:34,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:34,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-25 22:01:34,874 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-10-25 22:01:34,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:34,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372865927] [2020-10-25 22:01:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:34,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:35,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:35,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:35,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372865927] [2020-10-25 22:01:35,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:35,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 22:01:35,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120193106] [2020-10-25 22:01:35,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:01:35,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:35,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:01:35,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:01:35,045 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2020-10-25 22:01:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:35,160 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2020-10-25 22:01:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:01:35,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-25 22:01:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:35,163 INFO L225 Difference]: With dead ends: 157 [2020-10-25 22:01:35,163 INFO L226 Difference]: Without dead ends: 141 [2020-10-25 22:01:35,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:01:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-25 22:01:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-10-25 22:01:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-25 22:01:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-25 22:01:35,200 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-25 22:01:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:35,200 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-25 22:01:35,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:01:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-25 22:01:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 22:01:35,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:35,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:35,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-25 22:01:35,407 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2020-10-25 22:01:35,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:35,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422443143] [2020-10-25 22:01:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:35,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 22:01:35,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:35,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:35,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422443143] [2020-10-25 22:01:35,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:35,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-25 22:01:35,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838952194] [2020-10-25 22:01:35,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:01:35,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:01:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:01:35,503 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2020-10-25 22:01:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:35,553 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2020-10-25 22:01:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:01:35,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 22:01:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:35,554 INFO L225 Difference]: With dead ends: 96 [2020-10-25 22:01:35,554 INFO L226 Difference]: Without dead ends: 94 [2020-10-25 22:01:35,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:01:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-25 22:01:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2020-10-25 22:01:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-25 22:01:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-25 22:01:35,582 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-25 22:01:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:35,583 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-25 22:01:35,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:01:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-25 22:01:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:01:35,587 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:35,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:35,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-25 22:01:35,801 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1743883267, now seen corresponding path program 1 times [2020-10-25 22:01:35,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:35,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864402168] [2020-10-25 22:01:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:35,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:35,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:35,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:35,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:35,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:36,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:36,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864402168] [2020-10-25 22:01:36,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:36,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-25 22:01:36,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599495252] [2020-10-25 22:01:36,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:36,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:36,083 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2020-10-25 22:01:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:36,466 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2020-10-25 22:01:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:01:36,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-25 22:01:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:36,468 INFO L225 Difference]: With dead ends: 131 [2020-10-25 22:01:36,468 INFO L226 Difference]: Without dead ends: 118 [2020-10-25 22:01:36,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-25 22:01:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2020-10-25 22:01:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-25 22:01:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2020-10-25 22:01:36,479 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2020-10-25 22:01:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:36,479 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2020-10-25 22:01:36,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2020-10-25 22:01:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:01:36,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:36,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:36,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-25 22:01:36,693 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2020-10-25 22:01:36,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:36,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030357787] [2020-10-25 22:01:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:36,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-25 22:01:36,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:36,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:36,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:36,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:36,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:36,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030357787] [2020-10-25 22:01:36,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:36,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2020-10-25 22:01:36,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723633850] [2020-10-25 22:01:36,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 22:01:36,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:36,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 22:01:36,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-25 22:01:36,970 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2020-10-25 22:01:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:37,402 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2020-10-25 22:01:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:01:37,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-25 22:01:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:37,405 INFO L225 Difference]: With dead ends: 114 [2020-10-25 22:01:37,405 INFO L226 Difference]: Without dead ends: 78 [2020-10-25 22:01:37,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-10-25 22:01:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-25 22:01:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-10-25 22:01:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-25 22:01:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2020-10-25 22:01:37,413 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2020-10-25 22:01:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:37,413 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-10-25 22:01:37,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 22:01:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2020-10-25 22:01:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:01:37,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:37,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:37,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-25 22:01:37,631 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-10-25 22:01:37,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:37,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708366655] [2020-10-25 22:01:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:37,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:37,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:37,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:37,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:37,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:37,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:37,820 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:37,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:37,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708366655] [2020-10-25 22:01:37,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:37,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-25 22:01:37,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380945545] [2020-10-25 22:01:37,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:01:37,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:01:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:01:37,875 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2020-10-25 22:01:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:38,285 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-25 22:01:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:01:38,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-25 22:01:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:38,287 INFO L225 Difference]: With dead ends: 84 [2020-10-25 22:01:38,287 INFO L226 Difference]: Without dead ends: 74 [2020-10-25 22:01:38,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:01:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-25 22:01:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-25 22:01:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-25 22:01:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2020-10-25 22:01:38,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2020-10-25 22:01:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:38,298 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2020-10-25 22:01:38,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:01:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2020-10-25 22:01:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 22:01:38,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:38,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:38,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-25 22:01:38,514 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-10-25 22:01:38,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:38,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665964835] [2020-10-25 22:01:38,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:38,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 22:01:38,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:38,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:38,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:38,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:39,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665964835] [2020-10-25 22:01:39,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:39,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-25 22:01:39,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734712499] [2020-10-25 22:01:39,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:39,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:39,027 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2020-10-25 22:01:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:39,400 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2020-10-25 22:01:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:01:39,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-25 22:01:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:39,402 INFO L225 Difference]: With dead ends: 82 [2020-10-25 22:01:39,402 INFO L226 Difference]: Without dead ends: 74 [2020-10-25 22:01:39,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:01:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-25 22:01:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-25 22:01:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-25 22:01:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2020-10-25 22:01:39,414 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2020-10-25 22:01:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:39,414 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2020-10-25 22:01:39,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2020-10-25 22:01:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 22:01:39,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:39,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:39,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-25 22:01:39,631 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2020-10-25 22:01:39,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:39,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586726214] [2020-10-25 22:01:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:39,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 22:01:39,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:39,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-25 22:01:39,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:39,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:40,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 1] term [2020-10-25 22:01:40,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:40,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586726214] [2020-10-25 22:01:40,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:40,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2020-10-25 22:01:40,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15822940] [2020-10-25 22:01:40,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 22:01:40,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:40,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 22:01:40,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-25 22:01:40,229 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2020-10-25 22:01:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:41,559 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2020-10-25 22:01:41,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 22:01:41,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-10-25 22:01:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:41,561 INFO L225 Difference]: With dead ends: 154 [2020-10-25 22:01:41,561 INFO L226 Difference]: Without dead ends: 134 [2020-10-25 22:01:41,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2020-10-25 22:01:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-25 22:01:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2020-10-25 22:01:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-25 22:01:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2020-10-25 22:01:41,570 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2020-10-25 22:01:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:41,571 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2020-10-25 22:01:41,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 22:01:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2020-10-25 22:01:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 22:01:41,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:41,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:41,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-25 22:01:41,786 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2020-10-25 22:01:41,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:41,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305000856] [2020-10-25 22:01:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:41,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-25 22:01:41,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:41,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:41,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:41,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:42,263 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2020-10-25 22:01:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:42,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:42,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305000856] [2020-10-25 22:01:42,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:42,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2020-10-25 22:01:42,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573725107] [2020-10-25 22:01:42,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:01:42,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:01:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:42,516 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2020-10-25 22:01:43,973 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-10-25 22:01:44,200 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-10-25 22:01:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:45,327 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2020-10-25 22:01:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-25 22:01:45,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-10-25 22:01:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:45,329 INFO L225 Difference]: With dead ends: 195 [2020-10-25 22:01:45,329 INFO L226 Difference]: Without dead ends: 158 [2020-10-25 22:01:45,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2020-10-25 22:01:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-25 22:01:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2020-10-25 22:01:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-25 22:01:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2020-10-25 22:01:45,338 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2020-10-25 22:01:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:45,338 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-25 22:01:45,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:01:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-10-25 22:01:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 22:01:45,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:45,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:45,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-10-25 22:01:45,563 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:45,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:45,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1423958792, now seen corresponding path program 1 times [2020-10-25 22:01:45,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:45,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801980589] [2020-10-25 22:01:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:45,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-25 22:01:45,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:45,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:45,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:45,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:46,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801980589] [2020-10-25 22:01:46,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:46,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-10-25 22:01:46,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627608278] [2020-10-25 22:01:46,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 22:01:46,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:46,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 22:01:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:01:46,143 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2020-10-25 22:01:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:47,473 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2020-10-25 22:01:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-25 22:01:47,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-25 22:01:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:47,475 INFO L225 Difference]: With dead ends: 125 [2020-10-25 22:01:47,475 INFO L226 Difference]: Without dead ends: 101 [2020-10-25 22:01:47,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2020-10-25 22:01:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-25 22:01:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2020-10-25 22:01:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-25 22:01:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-10-25 22:01:47,483 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2020-10-25 22:01:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:47,484 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-25 22:01:47,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 22:01:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-10-25 22:01:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 22:01:47,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:47,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:47,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-25 22:01:47,699 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash 489956430, now seen corresponding path program 1 times [2020-10-25 22:01:47,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:47,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988406244] [2020-10-25 22:01:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:47,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:01:47,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:47,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:47,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:47,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:47,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:48,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988406244] [2020-10-25 22:01:48,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:48,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-25 22:01:48,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662406250] [2020-10-25 22:01:48,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:01:48,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:01:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:01:48,213 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-10-25 22:01:49,101 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-25 22:01:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:49,321 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-10-25 22:01:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 22:01:49,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-10-25 22:01:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:49,322 INFO L225 Difference]: With dead ends: 52 [2020-10-25 22:01:49,322 INFO L226 Difference]: Without dead ends: 41 [2020-10-25 22:01:49,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:01:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-25 22:01:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-25 22:01:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-25 22:01:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-25 22:01:49,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2020-10-25 22:01:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:49,329 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-25 22:01:49,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:01:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-10-25 22:01:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 22:01:49,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:49,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:49,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-25 22:01:49,544 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1191021008, now seen corresponding path program 1 times [2020-10-25 22:01:49,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:49,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085698617] [2020-10-25 22:01:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:49,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-25 22:01:49,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:49,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:01:49,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:49,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:49,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:49,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 1] term [2020-10-25 22:01:49,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:49,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085698617] [2020-10-25 22:01:49,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:49,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-25 22:01:49,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687371422] [2020-10-25 22:01:49,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-25 22:01:49,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-25 22:01:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:01:49,948 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2020-10-25 22:01:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:50,818 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-10-25 22:01:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:01:50,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-25 22:01:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:50,819 INFO L225 Difference]: With dead ends: 55 [2020-10-25 22:01:50,819 INFO L226 Difference]: Without dead ends: 41 [2020-10-25 22:01:50,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-10-25 22:01:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-25 22:01:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-10-25 22:01:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-25 22:01:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-10-25 22:01:50,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2020-10-25 22:01:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:50,825 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-10-25 22:01:50,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-25 22:01:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-10-25 22:01:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 22:01:50,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:50,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:51,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-25 22:01:51,038 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1654102483, now seen corresponding path program 1 times [2020-10-25 22:01:51,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:51,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967907887] [2020-10-25 22:01:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:51,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-25 22:01:51,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:51,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-25 22:01:51,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:01:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:51,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:51,433 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 1] term [2020-10-25 22:01:51,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 22:01:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:51,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967907887] [2020-10-25 22:01:51,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:51,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-25 22:01:51,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197285026] [2020-10-25 22:01:51,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 22:01:51,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 22:01:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:01:51,485 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2020-10-25 22:01:52,451 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2020-10-25 22:01:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:52,590 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-10-25 22:01:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:01:52,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-10-25 22:01:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:52,591 INFO L225 Difference]: With dead ends: 79 [2020-10-25 22:01:52,591 INFO L226 Difference]: Without dead ends: 61 [2020-10-25 22:01:52,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:01:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-25 22:01:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2020-10-25 22:01:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-25 22:01:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-10-25 22:01:52,610 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2020-10-25 22:01:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:52,610 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-25 22:01:52,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 22:01:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-10-25 22:01:52,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 22:01:52,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:01:52,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:01:52,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-10-25 22:01:52,823 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:01:52,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:01:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash 798574185, now seen corresponding path program 1 times [2020-10-25 22:01:52,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 22:01:52,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194194801] [2020-10-25 22:01:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-10-25 22:01:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:01:52,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 22:01:52,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:01:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:52,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 22:01:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:01:52,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194194801] [2020-10-25 22:01:52,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:01:52,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-25 22:01:52,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466326356] [2020-10-25 22:01:52,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:01:52,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 22:01:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:01:52,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:01:52,971 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2020-10-25 22:01:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:01:53,000 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-10-25 22:01:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:01:53,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-25 22:01:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:01:53,000 INFO L225 Difference]: With dead ends: 39 [2020-10-25 22:01:53,000 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 22:01:53,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:01:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 22:01:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 22:01:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 22:01:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 22:01:53,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-10-25 22:01:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:01:53,002 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 22:01:53,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:01:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 22:01:53,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 22:01:53,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-10-25 22:01:53,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 22:01:53,510 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 119 [2020-10-25 22:01:53,641 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 125 [2020-10-25 22:01:53,770 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 110 [2020-10-25 22:01:53,911 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 125 [2020-10-25 22:01:54,881 WARN L193 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2020-10-25 22:01:55,666 WARN L193 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 27 [2020-10-25 22:01:55,970 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2020-10-25 22:01:56,671 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 33 [2020-10-25 22:01:57,120 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2020-10-25 22:01:57,455 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-10-25 22:01:58,237 WARN L193 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 38 [2020-10-25 22:01:58,983 WARN L193 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 42 [2020-10-25 22:01:59,236 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2020-10-25 22:01:59,295 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 22:01:59,295 INFO L274 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L36(lines 36 42) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L69-3(lines 69 70) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-25 22:01:59,296 INFO L274 CegarLoopResult]: For program point L69-5(lines 69 85) no Hoare annotation was computed. [2020-10-25 22:01:59,297 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-25 22:01:59,297 INFO L274 CegarLoopResult]: For program point L69-7(lines 69 85) no Hoare annotation was computed. [2020-10-25 22:01:59,297 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 22:01:59,297 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 22:01:59,297 INFO L274 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-10-25 22:01:59,297 INFO L274 CegarLoopResult]: For program point L53-2(line 53) no Hoare annotation was computed. [2020-10-25 22:01:59,298 INFO L270 CegarLoopResult]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse0 (= ULTIMATE.start_fmax_float_~y .cse1) .cse2) (and (not (fp.eq .cse1 .cse1)) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse0) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 .cse2 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|)))) [2020-10-25 22:01:59,298 INFO L274 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-10-25 22:01:59,298 INFO L274 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-10-25 22:01:59,299 INFO L277 CegarLoopResult]: At program point L87(lines 59 88) the Hoare annotation is: true [2020-10-25 22:01:59,299 INFO L274 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-10-25 22:01:59,299 INFO L274 CegarLoopResult]: For program point L39(lines 39 42) no Hoare annotation was computed. [2020-10-25 22:01:59,299 INFO L274 CegarLoopResult]: For program point L39-1(lines 39 42) no Hoare annotation was computed. [2020-10-25 22:01:59,299 INFO L274 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2020-10-25 22:01:59,299 INFO L274 CegarLoopResult]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2020-10-25 22:01:59,300 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 22:01:59,300 INFO L270 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2020-10-25 22:01:59,300 INFO L270 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2020-10-25 22:01:59,300 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 22:01:59,300 INFO L270 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short20|)) (.cse1 (not |ULTIMATE.start_main_#t~short16|)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse2)) (and .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2))) [2020-10-25 22:01:59,300 INFO L270 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short20|) (not |ULTIMATE.start_main_#t~short16|) |ULTIMATE.start_main_#t~short19| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) [2020-10-25 22:01:59,300 INFO L270 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse1 .cse2 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|)) (and (not (fp.eq .cse3 .cse3)) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse1) (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) .cse0 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse1 (= ULTIMATE.start_fmax_float_~y .cse3) .cse2))) [2020-10-25 22:01:59,301 INFO L270 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) |ULTIMATE.start_main_#t~short24| .cse1 (= ULTIMATE.start_fmax_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse2) (and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse0 |ULTIMATE.start_main_#t~short24| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse1 .cse2 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|)))) [2020-10-25 22:01:59,301 INFO L270 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0))) [2020-10-25 22:01:59,301 INFO L270 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) [2020-10-25 22:01:59,301 INFO L274 CegarLoopResult]: For program point L33(lines 33 42) no Hoare annotation was computed. [2020-10-25 22:01:59,301 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 22:01:59,301 INFO L274 CegarLoopResult]: For program point L33-1(lines 33 42) no Hoare annotation was computed. [2020-10-25 22:01:59,302 INFO L274 CegarLoopResult]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2020-10-25 22:01:59,303 INFO L270 CegarLoopResult]: At program point L25-2(lines 25 29) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (not .cse1)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) .cse1 (= ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2020-10-25 22:01:59,303 INFO L274 CegarLoopResult]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2020-10-25 22:01:59,303 INFO L274 CegarLoopResult]: For program point L25-5(lines 25 29) no Hoare annotation was computed. [2020-10-25 22:01:59,303 INFO L270 CegarLoopResult]: At program point L25-6(lines 25 29) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse1) (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2020-10-25 22:01:59,303 INFO L274 CegarLoopResult]: For program point L25-7(lines 22 43) no Hoare annotation was computed. [2020-10-25 22:01:59,303 INFO L274 CegarLoopResult]: For program point L50(lines 50 52) no Hoare annotation was computed. [2020-10-25 22:01:59,303 INFO L274 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2020-10-25 22:01:59,303 INFO L270 CegarLoopResult]: At program point L42(lines 22 43) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (and (= ULTIMATE.start_fmax_float_~x .cse1) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq .cse1 .cse1) .cse0)))) [2020-10-25 22:01:59,304 INFO L270 CegarLoopResult]: At program point L42-1(lines 22 43) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse0 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse2 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse3 (= ULTIMATE.start_fmax_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) .cse1 .cse2 .cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse0 .cse2 .cse3))) [2020-10-25 22:01:59,304 INFO L274 CegarLoopResult]: For program point L75-2(lines 75 78) no Hoare annotation was computed. [2020-10-25 22:01:59,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:01:59 BoogieIcfgContainer [2020-10-25 22:01:59,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:01:59,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:01:59,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:01:59,363 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:01:59,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:01:28" (3/4) ... [2020-10-25 22:01:59,369 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 22:01:59,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-10-25 22:01:59,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 22:01:59,384 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-25 22:01:59,384 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:01:59,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2020-10-25 22:01:59,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && !~fp.eq~FLOAT(x, x) [2020-10-25 22:01:59,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) [2020-10-25 22:01:59,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && aux-!isnan_float(x) && isnan_float(y)-aux) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(x, x) [2020-10-25 22:01:59,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || (((((1bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) && x == x) && y == y) [2020-10-25 22:01:59,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || (((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && !(0bv32 == \result)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && x == x) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == y) [2020-10-25 22:01:59,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(x, x) && y == x) && ~fp.eq~FLOAT(\result, y)) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) || ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y)) || ((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) [2020-10-25 22:01:59,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == x && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y) || (((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && y == x) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) [2020-10-25 22:01:59,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == res && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) || (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && y == y)) || (((((((!~fp.eq~FLOAT(x, x) && y == x) && ~fp.eq~FLOAT(res, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, y)) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) [2020-10-25 22:01:59,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(x, x) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && y == x) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) || ((((((y == x && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2020-10-25 22:01:59,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && y == x) && ~fp.eq~FLOAT(res, y)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) || ((((((y == res && 0bv32 == \result) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) [2020-10-25 22:01:59,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && y == y) [2020-10-25 22:01:59,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && y == y [2020-10-25 22:01:59,467 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:01:59,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:01:59,469 INFO L168 Benchmark]: Toolchain (without parser) took 32487.80 ms. Allocated memory was 46.1 MB in the beginning and 83.9 MB in the end (delta: 37.7 MB). Free memory was 23.1 MB in the beginning and 44.6 MB in the end (delta: -21.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:59,470 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 37.7 MB. Free memory was 24.2 MB in the beginning and 24.2 MB in the end (delta: 19.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:59,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.58 ms. Allocated memory is still 46.1 MB. Free memory was 22.4 MB in the beginning and 22.9 MB in the end (delta: -464.5 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:59,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.91 ms. Allocated memory is still 46.1 MB. Free memory was 22.8 MB in the beginning and 30.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:59,471 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory is still 46.1 MB. Free memory was 30.3 MB in the beginning and 28.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:01:59,472 INFO L168 Benchmark]: RCFGBuilder took 637.76 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 28.5 MB in the beginning and 37.4 MB in the end (delta: -8.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:59,472 INFO L168 Benchmark]: TraceAbstraction took 31277.07 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 36.9 MB in the beginning and 49.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:59,473 INFO L168 Benchmark]: Witness Printer took 105.43 ms. Allocated memory is still 83.9 MB. Free memory was 49.7 MB in the beginning and 44.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:01:59,477 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.35 ms. Allocated memory is still 37.7 MB. Free memory was 24.2 MB in the beginning and 24.2 MB in the end (delta: 19.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 342.58 ms. Allocated memory is still 46.1 MB. Free memory was 22.4 MB in the beginning and 22.9 MB in the end (delta: -464.5 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.91 ms. Allocated memory is still 46.1 MB. Free memory was 22.8 MB in the beginning and 30.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory is still 46.1 MB. Free memory was 30.3 MB in the beginning and 28.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 637.76 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 28.5 MB in the beginning and 37.4 MB in the end (delta: -8.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31277.07 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 36.9 MB in the beginning and 49.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.1 GB. * Witness Printer took 105.43 ms. Allocated memory is still 83.9 MB. Free memory was 49.7 MB in the beginning and 44.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(x, x) && y == x) && ~fp.eq~FLOAT(\result, y)) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) || ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y)) || ((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && y == y - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && y == y) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((y == x && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y) || (((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && y == x) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(x, x) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && y == x) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) || ((((((y == x && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && y == x) && ~fp.eq~FLOAT(res, y)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) || ((((((y == res && 0bv32 == \result) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || (((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && !(0bv32 == \result)) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && x == x) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == res && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) || (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && y == y)) || (((((((!~fp.eq~FLOAT(x, x) && y == x) && ~fp.eq~FLOAT(res, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, y)) && y == y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && aux-!isnan_float(x) && isnan_float(y)-aux) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || (((((1bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) && x == x) && y == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1146 SDtfs, 2441 SDslu, 4709 SDs, 0 SdLazy, 1986 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 616 HoareAnnotationTreeSize, 14 FomulaSimplifications, 626146 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 14 FomulaSimplificationsInter, 38333 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 94524 SizeOfPredicates, 147 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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 proved your program to be correct! Received shutdown request...